A Tabu Search Approach to the Strategic Airlift Problem
نویسندگان
چکیده
منابع مشابه
A Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
متن کاملAn advanced tabu search approach to the dynamic airlift loading problem
This research effort presents a tabu search algorithm to solve the dynamic airlift loading problem. Given a set of palletized cargo items which require transportation from an aerial port of embarkation to an aerial port of debarkation within a pre-specified time frame, the dynamic airlift loading problem seeks to partition the pallets into aircraft loads, select an efficient and effective subse...
متن کاملA Tabu Search Approach To The Fuzzy Clustering Problem *
In this paper we consider the fuzzy clustering problem. This is a nonconvex problem that has many local minima. It has been studied by many researchers and the most well-known method is the fuzzy c-means algorithm. We develop a new algorithm for solving this problem based on a tabu search technique. Preliminary computational experience on the developed algorithm are encouraging and compare favo...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملSolving the maximum clique problem using a tabu search approach
We describe two variants of a tabu search heuristic, a deterministic one and a probabilistic one, for the maximum clique problem. This heuristic may be viewed as a natural alternative implementation of tabu search for this problem when compared to existing ones. We also present a new random graph generator, the/S-generator, which produces graphs with larger clique sizes than comparable ones obt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Military Operations Research
سال: 2007
ISSN: 1082-5983
DOI: 10.5711/morj.12.3.59